An effective PSO-inspired algorithm for the team orienteering problem

An effective PSO-inspired algorithm for the team orienteering problem

The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired algorithm (PSOiA) to solve the problem. Experiments conducted on ...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Metaheuristics for the team orienteering problem

An ILS Algorithm for the Team Orienteering Problem with Variable Profit

The Orienteering Problem (OP) is a routing problem that has numerous applications in various fields such as logistics and tourism. The objective is to determine a subset of nodes to visit so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of OP has led to many different variants, including the Team Orienteering Problem (TOP) and the...

The Team Orienteering Arc Routing Problem

The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP a set of potential customers, each associated with an arc of a directed graph, is available and a profit is collected when a potential customer is served that is when the associated arc is traversed. A fleet of vehicles is available to visit the cust...